Distributed Optimistic Concurrency Control for High Performance Transaction Processing
نویسنده
چکیده
The performance of high-volume transaction processing systems is determined by the degree of hardware and data contention. This is especially a problem in the case of distributed systems with glob~! transactions accessing and updating objects from multiple systems. While the conventional two-phase locking method 11f centralized systems can be adapted for concurrency control in distributed systems, it may restrict system throughput to very low levels. This is due to ~ significant increase in lock holding times and associated transaction waiting time for locks, as compared to centralized systems. Optimistic concurrency control (OCC) which is similarly extensible to distributed systems has the disadvantage of repeated transaction restarts, which is a weak point of currently proposed methods. We propose a new hybrid method based on OCC followed by locking, which is an integral part of distributed validation and two-phase commit. This new OCC method assures that a transaction failing its validation will not be reexecuted more than once, in general. Furthermore deadlocks, which are difficult to handle in a distributed environment, arc avoided by serializing lock requests. We outline implementation details and compare the performance of the new scheme with distributed two-
منابع مشابه
Distributed Transaction Processing on an Ordering Network
The increasing demand for high throughputs in transaction processing systems leads to high degrees of transaction concurrency and hence high data contention. The conventional dynamic two-phase locking (2PL) concurrency control (CC) technique causes system thrashing at high data contention levels, restricting transaction throughput. Optimistic concurrency control (OCC) is an alternative strategy...
متن کاملPerformance Modeling of an Enhanced Optimistic Locking Architecture for Concurrency Control in a Distributed Database System
Optimistic methods of concurrency control are gaining popularity. This is especially true with the resurgence of mobile and distributed databases during the last decade, which inherently rely on optimistic techniques to improve availability and performance of the distributed database systems. A key problem with optimistic techniques is that they do not perform well in highly conflict prone envi...
متن کاملDistributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency and, hence, higher data contention. The conventional two-phase locking (2PL) Concurrency Control (CC) method may, therefore, restrict system throughput to levels inconsistent with the available processing capacity. This is...
متن کاملA New Distributed Optimistic Concurrency Control Method and a Comparison of its Performance with Two-Phase Locking
Alexander Thomasian IBM T. J. Watson Research Center P.O. Box 704 Yorktown Heights, NY 10598, USA The performance of high-volume transaction processing systems is determined by the degree of contention for hardware resources as well as data. Data contention is especially a problem in the case of data partitioned (e.g., distributed) systems with global transactions accessing and updating objects...
متن کاملA Distributed Architecture for Transactions Synchronization in Distributed Database Systems
Various concurrency control algorithms have been proposed for use in distributed database systems. But, the number of algorithms available for the distributed concurrency control, come into one of three basic classes: locking algorithms, Timestamp algorithms and optimistic (or certification) algorithms. In this paper we are presenting a Distributed Transaction Processing Model and an approach f...
متن کامل